Fast multi-sequence shift-register synthesis with the Euclidean algorithm
نویسندگان
چکیده
منابع مشابه
Fast multi-sequence shift-register synthesis with the Euclidean algorithm
Feng and Tzeng’s generalization of the Extended Euclidean Algorithm synthesizes the shortest–length linear feedback shift–register for s ≥ 1 sequences, where each sequence has the same length n. In this contribution, it is shown that Feng and Tzeng’s algorithm which solves this multi–sequence shift–register problem has time complexity O(sn2). An acceleration based on the Divide and Conquer stra...
متن کاملShift-Register Synthesis (Modula m)
The Berlekamp-Massey algorithm takes a sequence of elements from a field and finds the shortest linear recurrence (or linear feedback shift register) that can generate the sequence. In this paper we extend the algorithm to the case when the elements of the sequence are integers modulo m, where m is an arbitrary integer with known prime decomposition.
متن کاملShift - Register Synthesis and BCH Decoding l
It is shown in this paper that the iterative algorithm introduced by Berlekamp for decoding BCH codes actually provides a general solution to the problem of synthesizing the shortest linear feedback shift register capable of generating a prescribed finite sequence of digits. The shit-register approach leads to a simple proof of the validity of the algorithm as well as providing additional insig...
متن کاملShift Register Design Using Multi Bit Flipflops
Timing Optimization is one of the most important objectives of the designer in the Modern VLSI world. Memory elements play a vital role in Digital World. The basic memory elements of designer considerations are Latch and flip flop. In this paper, we analyze the design of Single-bit Flip flop (SBFF) and made performance comparison over the Multi-bit Flip-flop (MBFF). For improving Flip flop perf...
متن کاملRecursive Shift Indexing: A Fast Multi-Pattern String Matching Algorithm
String matching algorithms are essential for network devices that filter packets and flows based on their payload. Applications like intrusion detection/prevention, web filtering, anti-virus, and anti-spam all raise the demand for efficient algorithms dealing with string matching. This paper presents a novel multi-pattern string matching algorithm which reduces character comparisons based on re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics of Communications
سال: 2011
ISSN: 1930-5346
DOI: 10.3934/amc.2011.5.667